Polyhedral Mesh Generation and Optimization for Non-manifold Domains
نویسندگان
چکیده
We present a preliminary method to generate polyhedral meshes of general non-manifold domains. The method is based on computing the dual of a general tetrahedral mesh. The resulting mesh respects the topology of the domain to the same extent as the input mesh. If the input tetrahedral mesh is Delaunay and well-centered, the resulting mesh is a Voronoi mesh with planar faces. For general tetrahedral meshes, the resulting mesh is a polyhedral mesh with straight edges but possibly curved faces. The initial mesh generation phase is followed by a mesh untangling and quality improvement technique. We demonstrate the technique on some simple to moderately complex domains.
منابع مشابه
Polyhedral Mesh Generation and A Treatise on Concave Geometrical Edges
Three methods are investigated to remove the concavity at the boundary edges and/or vertices during polyhedral mesh generation by a dual mesh method. The non-manifold elements insertion method is the first method examined. Concavity can be removed by inserting non-manifold surfaces along the concave edges and using them as an internal boundary before applying Delaunay mesh generation. Conical c...
متن کاملSharp Feature Preservation in Octree-Based Hexahedral Mesh Generation for CAD Assembly Models
This paper describes an automatic and robust approach to convert 3D CAD assembly models into unstructured hexahedral meshes that are conformal to the given B-Reps (boundary-representations) with sharp feature preservation. In previous works, we developed an octree-based isocontouring method to construct unstructured hexahedral meshes for manifold and non-manifold domains. However, sharp feature...
متن کاملMulti-Domain Constrained Triangulations Using Off-the-shelf Libraries
Abstract. The problem of building non-structured 3D meshes for use in numerical simulations has been intensively studied in the last three decades. Several aspects of the process have been focused, such as: how to subdivide domains into collections of tetrahedra while avoiding degenerate elements; how to use finer spatial resolutions in order to favor certain regions of the domains; how to main...
متن کاملDiscrete curvatures and Gauss maps for polyhedral surfaces
The paper concerns the problem of correct curvatures estimates directly from polygonal meshes. We present a new algorithm that allows the construction of unambiguous Gauss maps for a large class of polyhedral surfaces, including surfaces of non-convex objects and even non-manifold surfaces. The resulting Gauss map provides shape recognition and curvature characterisation of the polyhedral surfa...
متن کاملAn Automatic 3D Mesh Generation Method for Domains with Multiple Materials.
This paper describes an automatic and efficient approach to construct unstructured tetrahedral and hexahedral meshes for a composite domain made up of heterogeneous materials. The boundaries of these material regions form non-manifold surfaces. In earlier papers, we developed an octree-based isocontouring method to construct unstructured 3D meshes for a single-material (homogeneous) domain with...
متن کامل